Fiber-complemented graphs — I: structure and invariant subgraphs
نویسندگان
چکیده
منابع مشابه
Complemented Invariant Subspaces and Interpolation Sequences
It is shown that the invariant subspace of the Bergman space Ap of the unit disc, generated by a finite union of Hardy interpolation sequences, is complemented in Ap. Let D be the open unit disc of the complex plane C, and let H = H(D) denote the usual Hardy space. For 0 < p < ∞ the Bergman space A consists of analytic functions f on D such that ‖f‖p = ∫ D |f(z)| dA(z) < ∞, where dA is area mea...
متن کاملOn zero-divisor graphs of quotient rings and complemented zero-divisor graphs
For an arbitrary ring $R$, the zero-divisor graph of $R$, denoted by $Gamma (R)$, is an undirected simple graph that its vertices are all nonzero zero-divisors of $R$ in which any two vertices $x$ and $y$ are adjacent if and only if either $xy=0$ or $yx=0$. It is well-known that for any commutative ring $R$, $Gamma (R) cong Gamma (T(R))$ where $T(R)$ is the (total) quotient ring of $R$. In this...
متن کاملA Dynamic Data Structure for Counting Subgraphs in Sparse Graphs
We present a dynamic data structure representing a graph G, which allows addition and removal of edges from G and can determine the number of appearances of a graph of a bounded size as an induced subgraph of G. The queries are answered in constant time. When the data structure is used to represent graphs from a class with bounded expansion (which includes planar graphs and more generally all p...
متن کاملThe typical structure of graphs without given excluded subgraphs
Let L be a finite family of graphs. We describe the typical structure of L-free graphs, improving our earlier results [2] on the ErdősFrankl-Rödl theorem [6], by proving our earlier conjecture that, for p = p(L) = minL∈L χ(L)− 1, the structure of almost all L-free graphs is very similar to that of a random subgraph of the Turán graph Tn,p. The “similarity” is measured in terms of graph theoreti...
متن کاملGraphs with Forbidden Subgraphs
Many graphs which are encountered in the study of graph theory are characterized by a type of configuration or subgraph they possess. However, there are occasions when such graphs are more easily defined or described by the kind of subgraphs they are not permitted to contain. For example, a tree can be defined as a connected graph which contains no cycles, and Kuratowski [22] characterized plan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2001
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(00)00183-7